TSTP Solution File: ITP166^1 by Leo-III-SAT---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : ITP166^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  7 10:36:29 EDT 2024

% Result   : Theorem 10.97s 3.45s
% Output   : Refutation 10.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   46
% Syntax   : Number of formulae    :   62 (   8 unt;  41 typ;   0 def)
%            Number of atoms       :   61 (   2 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  240 (  24   ~;  14   |;   9   &; 193   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Number of types       :   28 (  27 usr)
%            Number of type conns  :   45 (  45   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  14 usr;   6 con; 0-6 aty)
%            Number of variables   :   15 (   0   ^   9   !;   6   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
thf(set_Pr1333062727ar_int_type,type,
    set_Pr1333062727ar_int: $tType ).

thf(produc1346207591ar_int_type,type,
    produc1346207591ar_int: $tType ).

thf(set_li1762364675ar_int_type,type,
    set_li1762364675ar_int: $tType ).

thf(set_Pr446800905yperep_type,type,
    set_Pr446800905yperep: $tType ).

thf(list_P1741976099ar_int_type,type,
    list_P1741976099ar_int: $tType ).

thf(set_Pr1148378109ar_int_type,type,
    set_Pr1148378109ar_int: $tType ).

thf(set_Pr1560408065st_nat_type,type,
    set_Pr1560408065st_nat: $tType ).

thf(produc490010537yperep_type,type,
    produc490010537yperep: $tType ).

thf(produc1260470173ar_int_type,type,
    produc1260470173ar_int: $tType ).

thf(produc1699244961st_nat_type,type,
    produc1699244961st_nat: $tType ).

thf(set_Pr1097818217yperep_type,type,
    set_Pr1097818217yperep: $tType ).

thf(set_Pr1986765409at_nat_type,type,
    set_Pr1986765409at_nat: $tType ).

thf(produc1788831497yperep_type,type,
    produc1788831497yperep: $tType ).

thf(product_prod_nat_nat_type,type,
    product_prod_nat_nat: $tType ).

thf(set_list_typerep_type,type,
    set_list_typerep: $tType ).

thf(list_typerep_type,type,
    list_typerep: $tType ).

thf(set_typerep_type,type,
    set_typerep: $tType ).

thf(list_char_type,type,
    list_char: $tType ).

thf(list_nat_type,type,
    list_nat: $tType ).

thf(set_nat_type,type,
    set_nat: $tType ).

thf(typerep_type,type,
    typerep: $tType ).

thf(literal_type,type,
    literal: $tType ).

thf(bexp_type,type,
    bexp: $tType ).

thf(aexp_type,type,
    aexp: $tType ).

thf(nat_type,type,
    nat: $tType ).

thf(int_type,type,
    int: $tType ).

thf(com_type,type,
    com: $tType ).

thf(bval_type,type,
    bval: bexp > ( list_char > int ) > $o ).

thf(big_big_step_type,type,
    big_big_step: produc1260470173ar_int > ( list_char > int ) > $o ).

thf(suc_type,type,
    suc: nat > nat ).

thf(produc1193801173ar_int_type,type,
    produc1193801173ar_int: com > ( list_char > int ) > produc1260470173ar_int ).

thf(relati23543761ar_int_type,type,
    relati23543761ar_int: ( ( list_char > int ) > ( list_char > int ) > $o ) > bexp > com > nat > ( list_char > int ) > ( list_char > int ) > $o ).

thf(p_type,type,
    p: ( list_char > int ) > ( list_char > int ) > $o ).

thf(b_type,type,
    b: bexp ).

thf(c_type,type,
    c: com ).

thf(c2_type,type,
    c2: com ).

thf(ka_type,type,
    ka: nat ).

thf(s_a_type,type,
    s_a: list_char > int ).

thf(sa_type,type,
    sa: list_char > int ).

thf(t_a_type,type,
    t_a: list_char > int ).

thf(ta_type,type,
    ta: list_char > int ).

thf(95,axiom,
    relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ s_a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_Suc_Oprems_I7_J) ).

thf(529,plain,
    relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ s_a,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[95]) ).

thf(181,axiom,
    big_big_step @ ( produc1193801173ar_int @ c2 @ s_a ) @ t_a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_Suc_Oprems_I4_J) ).

thf(805,plain,
    big_big_step @ ( produc1193801173ar_int @ c2 @ s_a ) @ t_a,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[181]) ).

thf(134,axiom,
    big_big_step @ ( produc1193801173ar_int @ c @ sa ) @ ta,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_Suc_Oprems_I3_J) ).

thf(643,plain,
    big_big_step @ ( produc1193801173ar_int @ c @ sa ) @ ta,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[134]) ).

thf(1,conjecture,
    ? [A: list_char > int,B: list_char > int] :
      ( ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ A @ B )
      & ( bval @ b @ A )
      & ( big_big_step @ ( produc1193801173ar_int @ c @ A ) @ ta )
      & ( big_big_step @ ( produc1193801173ar_int @ c2 @ B ) @ t_a ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(2,negated_conjecture,
    ~ ? [A: list_char > int,B: list_char > int] :
        ( ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ A @ B )
        & ( bval @ b @ A )
        & ( big_big_step @ ( produc1193801173ar_int @ c @ A ) @ ta )
        & ( big_big_step @ ( produc1193801173ar_int @ c2 @ B ) @ t_a ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(188,plain,
    ~ ? [A: list_char > int,B: list_char > int] :
        ( ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ A @ B )
        & ( bval @ b @ A )
        & ( big_big_step @ ( produc1193801173ar_int @ c @ A ) @ ta )
        & ( big_big_step @ ( produc1193801173ar_int @ c2 @ B ) @ t_a ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(189,plain,
    ! [B: list_char > int,A: list_char > int] :
      ( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ A @ B )
      | ~ ( bval @ b @ A )
      | ~ ( big_big_step @ ( produc1193801173ar_int @ c @ A ) @ ta )
      | ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ B ) @ t_a ) ),
    inference(cnf,[status(esa)],[188]) ).

thf(839,plain,
    ! [B: list_char > int,A: list_char > int] :
      ( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ A @ B )
      | ~ ( bval @ b @ A )
      | ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ B ) @ t_a )
      | ( ( big_big_step @ ( produc1193801173ar_int @ c @ sa ) @ ta )
       != ( big_big_step @ ( produc1193801173ar_int @ c @ A ) @ ta ) ) ),
    inference(paramod_ordered,[status(thm)],[643,189]) ).

thf(840,plain,
    ! [A: list_char > int] :
      ( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ A )
      | ~ ( bval @ b @ sa )
      | ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ A ) @ t_a ) ),
    inference(pattern_uni,[status(thm)],[839:[bind(A,$thf( sa )),bind(B,$thf( B ))]]) ).

thf(843,plain,
    ! [A: list_char > int] :
      ( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ A )
      | ~ ( bval @ b @ sa )
      | ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ A ) @ t_a ) ),
    inference(simp,[status(thm)],[840]) ).

thf(144,axiom,
    bval @ b @ sa,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_Suc_Oprems_I6_J) ).

thf(672,plain,
    bval @ b @ sa,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[144]) ).

thf(848,plain,
    ! [A: list_char > int] :
      ( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ A )
      | ~ $true
      | ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ A ) @ t_a ) ),
    inference(rewrite,[status(thm)],[843,672]) ).

thf(849,plain,
    ! [A: list_char > int] :
      ( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ A )
      | ~ ( big_big_step @ ( produc1193801173ar_int @ c2 @ A ) @ t_a ) ),
    inference(simp,[status(thm)],[848]) ).

thf(850,plain,
    ! [A: list_char > int] :
      ( ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ A )
      | ( ( big_big_step @ ( produc1193801173ar_int @ c2 @ s_a ) @ t_a )
       != ( big_big_step @ ( produc1193801173ar_int @ c2 @ A ) @ t_a ) ) ),
    inference(paramod_ordered,[status(thm)],[805,849]) ).

thf(851,plain,
    ~ ( relati23543761ar_int @ p @ b @ c @ ( suc @ ka ) @ sa @ s_a ),
    inference(pattern_uni,[status(thm)],[850:[bind(A,$thf( s_a ))]]) ).

thf(911,plain,
    $false,
    inference(rewrite,[status(thm)],[529,851]) ).

thf(912,plain,
    $false,
    inference(simp,[status(thm)],[911]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ITP166^1 : TPTP v8.1.2. Released v7.5.0.
% 0.06/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n006.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Mon May  6 22:24:39 EDT 2024
% 0.16/0.36  % CPUTime  : 
% 0.87/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.84/1.09  % [INFO] 	 Parsing done (244ms). 
% 1.84/1.10  % [INFO] 	 Running in sequential loop mode. 
% 2.62/1.32  % [INFO] 	 nitpick registered as external prover. 
% 2.62/1.32  % [INFO] 	 Scanning for conjecture ... 
% 2.77/1.42  % [INFO] 	 Found a conjecture and 221 axioms. Running axiom selection ... 
% 3.18/1.52  % [INFO] 	 Axiom selection finished. Selected 185 axioms (removed 36 axioms). 
% 3.61/1.68  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 3.83/1.69  % [INFO] 	 Type checking passed. 
% 3.83/1.70  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 10.97/3.45  % [INFO] 	 Killing All external provers ... 
% 10.97/3.45  % Time passed: 2924ms (effective reasoning time: 2340ms)
% 10.97/3.45  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 10.97/3.45  % Axioms used in derivation (4): fact_4_Suc_Oprems_I7_J, fact_3_Suc_Oprems_I4_J, fact_2_Suc_Oprems_I3_J, fact_0_Suc_Oprems_I6_J
% 10.97/3.45  % No. of inferences in proof: 21
% 10.97/3.45  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2924 ms resp. 2340 ms w/o parsing
% 10.97/3.47  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.97/3.47  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------